Rhythmic generation of infinite trees and languages
نویسندگان
چکیده
This work introduces the idea of breadth-first generation of infinite trees and languages. It is orthogonal to usual descriptions by classical objects such as automata and grammars which refer more naturally to a depth-first approach. This idea is brought into play with periodic inputs, a case that comes from the study of rational base number systems which correspond to specific inputs derived from Christoffel words. Conversely, we characterise languages generated in that way as representations of integers in such number systems with non-canonical alphabets of digits.
منابع مشابه
O23: Modulation of Pacemaker Channels and Rhythmic Thalamic Activity by Demyelination and Inflammatory Cytokines
The thalamus is a central element for the generation of rhythmic oscillatory activity under physiological and pathophysiological conditions. Especially slow oscillations in the delta and theta frequency band which normally occur during slow-wave sleep are associated with a number of neuropsychiatric conditions if they occur during wakefulness and may be the basis for the generation of character...
متن کاملFundamental Properties of Infinite Trees
Abstrwt. Infinite trees naturally arise in the formaliration and the c~udy of fhc \cm;lntic*, 01 prog-amming languages. This paper investigates some of their i:omninatorial and :iIgcbri\ic propei ties that are especially relevant to semantics. This paper is concerned in particular with regtilar and algchraic itlfinitc trees, rlor ln.ith rzg\lI;lr or algebraic s4f.s of infinite trees. For this r...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملAutomata and Algebras for Infinite Words and Trees
Regular languages can be studied not just for finite words, but also for finite trees, infinite words and infinite trees. Almost all of the theory of regular languages, such as closure under boolean operations, works also for these extensions, but the constructions are significantly more challenging and mathematically interesting. For instance, automata for infinite words can be determinised un...
متن کاملAutomata on Inifinite Trees
This article presents the basic theory of automata on infinite trees. We introduce the standard model of nondeterministic automata and the generalization to alternating automata. The central part of the theory considers the closure properties of tree languages definable by such automata, the equivalence of the different models, and their algorithmic properties. We show how these results are obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1403.5190 شماره
صفحات -
تاریخ انتشار 2014